TSTP Solution File: QUA020^1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : QUA020^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 13:31:31 EDT 2023
% Result : Timeout 299.47s 300.16s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : QUA020^1 : TPTP v8.1.2. Released v4.1.0.
% 0.12/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n019.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 16:41:58 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.48 %----Proving TH0
% 0.20/0.48 %------------------------------------------------------------------------------
% 0.20/0.48 % File : QUA020^1 : TPTP v8.1.2. Released v4.1.0.
% 0.20/0.48 % Domain : Quantales
% 0.20/0.48 % Problem : Addition splitting
% 0.20/0.48 % Version : [Hoe09] axioms.
% 0.20/0.48 % English : An element is an upper bound of a sum iff it is an upper bound of
% 0.20/0.48 % : all its summands.
% 0.20/0.48
% 0.20/0.48 % Refs : [Con71] Conway (1971), Regular Algebra and Finite Machines
% 0.20/0.48 % : [Hoe09] Hoefner (2009), Email to Geoff Sutcliffe
% 0.20/0.48 % Source : [Hoe09]
% 0.20/0.48 % Names : QUA20 [Hoe09]
% 0.20/0.48
% 0.20/0.48 % Status : Theorem
% 0.20/0.48 % Rating : 1.00 v4.1.0
% 0.20/0.48 % Syntax : Number of formulae : 27 ( 13 unt; 12 typ; 7 def)
% 0.20/0.48 % Number of atoms : 39 ( 17 equ; 0 cnn)
% 0.20/0.48 % Maximal formula atoms : 4 ( 2 avg)
% 0.20/0.48 % Number of connectives : 53 ( 0 ~; 1 |; 5 &; 45 @)
% 0.20/0.48 % ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% 0.20/0.48 % Maximal formula depth : 9 ( 2 avg)
% 0.20/0.48 % Number of types : 2 ( 0 usr)
% 0.20/0.48 % Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% 0.20/0.49 % Number of symbols : 16 ( 14 usr; 5 con; 0-3 aty)
% 0.20/0.49 % Number of variables : 30 ( 15 ^; 11 !; 4 ?; 30 :)
% 0.20/0.49 % SPC : TH0_THM_EQU_NAR
% 0.20/0.49
% 0.20/0.49 % Comments :
% 0.20/0.49 %------------------------------------------------------------------------------
% 0.20/0.49 %----Include axioms for Quantales
% 0.20/0.49 %------------------------------------------------------------------------------
% 0.20/0.49 %----Usual Definition of Set Theory
% 0.20/0.49 thf(emptyset_type,type,
% 0.20/0.49 emptyset: $i > $o ).
% 0.20/0.49
% 0.20/0.49 thf(emptyset_def,definition,
% 0.20/0.49 ( emptyset
% 0.20/0.49 = ( ^ [X: $i] : $false ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(union_type,type,
% 0.20/0.49 union: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.20/0.49
% 0.20/0.49 thf(union_def,definition,
% 0.20/0.49 ( union
% 0.20/0.49 = ( ^ [X: $i > $o,Y: $i > $o,U: $i] :
% 0.20/0.49 ( ( X @ U )
% 0.20/0.49 | ( Y @ U ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(singleton_type,type,
% 0.20/0.49 singleton: $i > $i > $o ).
% 0.20/0.49
% 0.20/0.49 thf(singleton_def,definition,
% 0.20/0.49 ( singleton
% 0.20/0.49 = ( ^ [X: $i,U: $i] : ( U = X ) ) ) ).
% 0.20/0.49
% 0.20/0.49 %----Supremum Definition
% 0.20/0.49 thf(zero_type,type,
% 0.20/0.49 zero: $i ).
% 0.20/0.49
% 0.20/0.49 thf(sup_type,type,
% 0.20/0.49 sup: ( $i > $o ) > $i ).
% 0.20/0.49
% 0.20/0.49 thf(sup_es,axiom,
% 0.20/0.49 ( ( sup @ emptyset )
% 0.20/0.49 = zero ) ).
% 0.20/0.49
% 0.20/0.49 thf(sup_singleset,axiom,
% 0.20/0.49 ! [X: $i] :
% 0.20/0.49 ( ( sup @ ( singleton @ X ) )
% 0.20/0.49 = X ) ).
% 0.20/0.49
% 0.20/0.49 thf(supset_type,type,
% 0.20/0.49 supset: ( ( $i > $o ) > $o ) > $i > $o ).
% 0.20/0.49
% 0.20/0.49 thf(supset,definition,
% 0.20/0.49 ( supset
% 0.20/0.49 = ( ^ [F: ( $i > $o ) > $o,X: $i] :
% 0.20/0.49 ? [Y: $i > $o] :
% 0.20/0.49 ( ( F @ Y )
% 0.20/0.49 & ( ( sup @ Y )
% 0.20/0.49 = X ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(unionset_type,type,
% 0.20/0.49 unionset: ( ( $i > $o ) > $o ) > $i > $o ).
% 0.20/0.49
% 0.20/0.49 thf(unionset,definition,
% 0.20/0.49 ( unionset
% 0.20/0.49 = ( ^ [F: ( $i > $o ) > $o,X: $i] :
% 0.20/0.49 ? [Y: $i > $o] :
% 0.20/0.49 ( ( F @ Y )
% 0.20/0.49 & ( Y @ X ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(sup_set,axiom,
% 0.20/0.49 ! [X: ( $i > $o ) > $o] :
% 0.20/0.49 ( ( sup @ ( supset @ X ) )
% 0.20/0.49 = ( sup @ ( unionset @ X ) ) ) ).
% 0.20/0.49
% 0.20/0.49 %----Definition of binary sums and lattice order
% 0.20/0.49 thf(addition_type,type,
% 0.20/0.49 addition: $i > $i > $i ).
% 0.20/0.49
% 0.20/0.49 thf(addition_def,definition,
% 0.20/0.49 ( addition
% 0.20/0.49 = ( ^ [X: $i,Y: $i] : ( sup @ ( union @ ( singleton @ X ) @ ( singleton @ Y ) ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(order_type,type,
% 0.20/0.49 leq: $i > $i > $o ).
% 0.20/0.49
% 0.20/0.49 thf(order_def,axiom,
% 0.20/0.49 ! [X1: $i,X2: $i] :
% 0.20/0.49 ( ( leq @ X1 @ X2 )
% 0.20/0.49 <=> ( ( addition @ X1 @ X2 )
% 0.20/0.49 = X2 ) ) ).
% 0.20/0.49
% 0.20/0.49 %----Definition of multiplication
% 0.20/0.49 thf(multiplication_type,type,
% 0.20/0.49 multiplication: $i > $i > $i ).
% 0.20/0.49
% 0.20/0.49 thf(crossmult_type,type,
% 0.20/0.49 crossmult: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.20/0.49
% 0.20/0.49 thf(crossmult_def,definition,
% 0.20/0.49 ( crossmult
% 0.20/0.49 = ( ^ [X: $i > $o,Y: $i > $o,A: $i] :
% 0.20/0.49 ? [X1: $i,Y1: $i] :
% 0.20/0.49 ( ( X @ X1 )
% 0.20/0.49 & ( Y @ Y1 )
% 0.20/0.49 & ( A
% 0.20/0.49 = ( multiplication @ X1 @ Y1 ) ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(multiplication_def,axiom,
% 0.20/0.49 ! [X: $i > $o,Y: $i > $o] :
% 0.20/0.49 ( ( multiplication @ ( sup @ X ) @ ( sup @ Y ) )
% 0.20/0.49 = ( sup @ ( crossmult @ X @ Y ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(one_type,type,
% 0.20/0.49 one: $i ).
% 0.20/0.49
% 0.20/0.49 thf(multiplication_neutral_right,axiom,
% 0.20/0.49 ! [X: $i] :
% 0.20/0.49 ( ( multiplication @ X @ one )
% 0.20/0.49 = X ) ).
% 0.20/0.49
% 0.20/0.49 thf(multiplication_neutral_left,axiom,
% 0.20/0.49 ! [X: $i] :
% 0.20/0.49 ( ( multiplication @ one @ X )
% 0.20/0.49 /export/starexec/sandbox/solver/bin/do_THM_THF: line 35: 19453 Alarm clock ( read result; case "$result" in
% 299.47/300.16 unsat)
% 299.47/300.16 echo "% SZS status $unsatResult for $tptpfilename"; echo "% SZS output start Proof for $tptpfilename"; cat; echo "% SZS output end Proof for $tptpfilename"; exit 0
% 299.47/300.16 ;;
% 299.47/300.16 sat)
% 299.47/300.16 echo "% SZS status $satResult for $tptpfilename"; cat; exit 0
% 299.47/300.16 ;;
% 299.47/300.16 esac; exit 1 )
% 299.47/300.17 = X ) ).
% 299.47/300.17
% 299.47/300.17 %------------------------------------------------------------------------------
% 299.47/300.17 %------------------------------------------------------------------------------
% 299.47/300.17 thf(splitting,conjecture,
% 299.47/300.17 ! [X: $i,Y: $i,Z: $i] :
% 299.47/300.17 ( ( leq @ ( addition @ X @ Y ) @ Z )
% 299.47/300.17 <=> ( ( leq @ X @ Z )
% 299.47/300.17 & ( leq @ Y @ Z ) ) ) ).
% 299.47/300.17
% 299.47/300.17 %------------------------------------------------------------------------------
% 299.47/300.17 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.4fmMU52IEZ/cvc5---1.0.5_19187.p...
% 299.47/300.17 (declare-sort $$unsorted 0)
% 299.47/300.17 (declare-fun tptp.emptyset ($$unsorted) Bool)
% 299.47/300.17 (assert (= tptp.emptyset (lambda ((X $$unsorted)) false)))
% 299.47/300.17 (declare-fun tptp.union ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 299.47/300.17 (assert (= tptp.union (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (U $$unsorted)) (or (@ X U) (@ Y U)))))
% 299.47/300.17 (declare-fun tptp.singleton ($$unsorted $$unsorted) Bool)
% 299.47/300.17 (assert (= tptp.singleton (lambda ((X $$unsorted) (U $$unsorted)) (= U X))))
% 299.47/300.17 (declare-fun tptp.zero () $$unsorted)
% 299.47/300.17 (declare-fun tptp.sup ((-> $$unsorted Bool)) $$unsorted)
% 299.47/300.17 (assert (= (@ tptp.sup tptp.emptyset) tptp.zero))
% 299.47/300.17 (assert (forall ((X $$unsorted)) (= (@ tptp.sup (@ tptp.singleton X)) X)))
% 299.47/300.17 (declare-fun tptp.supset ((-> (-> $$unsorted Bool) Bool) $$unsorted) Bool)
% 299.47/300.17 (assert (= tptp.supset (lambda ((F (-> (-> $$unsorted Bool) Bool)) (X $$unsorted)) (exists ((Y (-> $$unsorted Bool))) (and (@ F Y) (= (@ tptp.sup Y) X))))))
% 299.47/300.17 (declare-fun tptp.unionset ((-> (-> $$unsorted Bool) Bool) $$unsorted) Bool)
% 299.47/300.17 (assert (= tptp.unionset (lambda ((F (-> (-> $$unsorted Bool) Bool)) (X $$unsorted)) (exists ((Y (-> $$unsorted Bool))) (and (@ F Y) (@ Y X))))))
% 299.47/300.17 (assert (forall ((X (-> (-> $$unsorted Bool) Bool))) (= (@ tptp.sup (@ tptp.supset X)) (@ tptp.sup (@ tptp.unionset X)))))
% 299.47/300.17 (declare-fun tptp.addition ($$unsorted $$unsorted) $$unsorted)
% 299.47/300.17 (assert (= tptp.addition (lambda ((X $$unsorted) (Y $$unsorted)) (@ tptp.sup (@ (@ tptp.union (@ tptp.singleton X)) (@ tptp.singleton Y))))))
% 299.47/300.17 (declare-fun tptp.leq ($$unsorted $$unsorted) Bool)
% 299.47/300.17 (assert (forall ((X1 $$unsorted) (X2 $$unsorted)) (= (@ (@ tptp.leq X1) X2) (= (@ (@ tptp.addition X1) X2) X2))))
% 299.47/300.17 (declare-fun tptp.multiplication ($$unsorted $$unsorted) $$unsorted)
% 299.47/300.17 (declare-fun tptp.crossmult ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 299.47/300.17 (assert (= tptp.crossmult (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (A $$unsorted)) (exists ((X1 $$unsorted) (Y1 $$unsorted)) (and (@ X X1) (@ Y Y1) (= A (@ (@ tptp.multiplication X1) Y1)))))))
% 299.47/300.17 (assert (forall ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool))) (= (@ (@ tptp.multiplication (@ tptp.sup X)) (@ tptp.sup Y)) (@ tptp.sup (@ (@ tptp.crossmult X) Y)))))
% 299.47/300.17 (declare-fun tptp.one () $$unsorted)
% 299.47/300.17 (assert (forall ((X $$unsorted)) (= (@ (@ tptp.multiplication X) tptp.one) X)))
% 299.47/300.17 (assert (forall ((X $$unsorted)) (= (@ (@ tptp.multiplication tptp.one) X) X)))
% 299.47/300.17 (assert (not (forall ((X $$unsorted) (Y $$unsorted) (Z $$unsorted)) (= (@ (@ tptp.leq (@ (@ tptp.addition X) Y)) Z) (and (@ (@ tptp.leq X) Z) (@ (@ tptp.leq Y) Z))))))
% 299.47/300.17 (set-info :filename cvc5---1.0.5_19187)
% 299.47/300.17 (check-sat-assuming ( true ))
% 299.47/300.17 ------- get file name : TPTP file name is QUA020^1
% 299.47/300.17 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_19187.smt2...
% 299.47/300.17 --- Run --ho-elim --full-saturate-quant at 10...
% 299.47/300.17 --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 299.47/300.17 --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 299.47/300.17 --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 299.47/300.17 --- Run --no-ho-matching --finite-model-find --uf-ss=no-minimal at 5...
% 299.47/300.17 --- Run --no-ho-matching --full-saturate-quant --enum-inst-interleave --ho-elim-store-ax at 10...
% 299.47/300.17 --- Run --no-ho-matching --full-saturate-quant --macros-quant-mode=all at 10...
% 299.47/300.17 --- Run --ho-elim --full-saturate-quant --enum-inst-interleave at 10...
% 299.47/300.17 --- Run --no-ho-matching --full-saturate-quant --ho-elim-store-ax at 10...
% 299.47/300.17 --- Run --ho-elim --no-ho-elim-store-ax --full-saturate-quant...
% 299.47/300.17 % cvc5---1.0.5 exiting
% 299.47/300.17 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------